A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

信息化条件下基于大数据的后装一体化保障构想

由于契约的不完全性、专用性资产的存在,导致民企参军的谈判过程中,一方可能利用另一方因专用性资产投资的锁定效应,而采取机会主义行为将另一方套牢,攫取可占用专用性准租金。这种套牢风险不是单向的,而是双向的,双向套牢风险的存在不仅会降低军品科研生产项目建设质量,而且还会严重挫伤民营企业承担军品科研生产任务的积极性。为有效防范双向套牢风险,本文将从博弈论的角度,建立民营企业与军队采办部门的期望收益与专用性资产投资的函数关系和博弈矩阵,分阶段讨论民营企业与军队采办部门所面临的套牢风险大小及各自的最佳行为选择。以降低民企参军面临的套牢风险,引导更多优势民营企业进入军品科研生产与维修领域,推动军民融合的深度发展。     

游标卡尺实验中值得注意的几个问题

对游标卡尺实验中普遍存在的问题进行了分析与讨论 ,并给出了合理的解释。     

线性电路的冲激响应

在线性电路分析中,直接求解线性时变电路的冲激响应一般是很困难的。但是,可带求解冲激响应的问题转化为在一组等效的初始条件下求解零输入响应的问题,关键在于得出这组等效的初始条件。文中介绍了一种求等效初始条件的方法。     

一个组合对策问题的解

本文求解如下的组合对策问题:设有一堆棋子,总数N 是奇数,甲乙两人轮流取子,每人每次可取一颗、二颗,最多可取s 颗,但不能不取,直至取完后分别来数甲乙两人所取棋子的总数,总数为奇数者获胜。站在甲的立场上考虑获胜的策略,文中解决了如下两个问题:(Ⅰ)总数N 应是什么样的奇数,甲才有获胜策略;(Ⅱ)当N 一定时,甲应采取什么样的策略取子,才能获胜。     

再入机动弹头滚动回路鲁棒姿态控制系统设计

根据经典控制理论,引入姿态角加速度反馈,采用零、极点相消,变增益补偿等设计方法,所设计的再入机动弹头滚动回路姿态控制系统具有良好的快速性、稳定性和很强的鲁棒性。     

数据光滑的一种新方法

提出了用变形的Fourier部分和来代替Fourier级数将输入数据光滑的一种新方法。该方法能稳定地解某些不适定的问题,如给定函数的近似,求函数微分的问题;Laplace方程Cauchy问题;时间逆向热传导方程的Cauchy问题等。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

保密通信中同相和正交通道失衡对干扰抑制性能的影响

针对同时存在恶意干扰与非法窃听的通信环境,提出一种协作干扰(cooperative jamming, CJ)掩护的保密通信架构,收发信机之间采用跳频技术躲避恶意干扰,并采用协作干扰技术阻塞非法窃听。但该架构的通信带宽较大,会在收发频率振荡器中引起显著的同相和正交(in-phase and quadrature, IQ)通道失衡。鉴于此,对收发IQ通道失衡引起的信号失真进行数学建模,给出接收机处信干噪比的数学表达式,并给出干扰抑制比的闭合表达式。仿真结果表明,收发IQ通道失衡引起的信号失真的功率远大于热噪声功率。随着收发IQ通道失衡加剧,所提架构的信干噪比和干扰抑制比性能均会急剧下降,当幅度和相位失衡分别达到0.95和π/50时,信干噪比和干扰抑制比均损失了47 dB。